构造一个3*3的拉丁方阵,使该矩阵中的每行每列中数字1,2,3都只出现一次...答:int i, j, k;init(seed, a);for(i=0; i<3; i++){ for(j=0; j<3; j++){ if(j!=i){ k=3-i-j;memcpy(x[0],a[i],sizeof(int[3]));memcpy(x[1],a[j],sizeof(int[3]));memcpy(x[2],a[k],sizeof(int[3]));print(x);printf("\n");} } } } void ...
NOip2009 Hankson的趣味题答:看一下我的结题报告发上去 var i,n:longint;function gcd(a,b:longint):longint;var r:longint;begin while b<>0 do begin r:=a mod b;a:=b;b:=r;end;exit(a);end;function work:longint;var a0,a1,b0,b1,k,px,total,x,q,i,bk,y,my:longint;begin readln(a0,a1,b0,b1)...
跪求一个java课程设计,学生学籍管理系统,超市管理系统,图书管理系统...答:memcpy(p,p+1,sizeof(struct student)); memset(p+1,0,sizeof(struct student)); } n--; return n;}/*---文件保存模块---*/void SaveScoreFile(STU *head,const int n,const int m){ FILE *fp; int i; STU *p=head; if((fp=fopen("record","wb"))==NULL) { printf("can not open ...